GSOS for probabilisti transition systems
نویسنده
چکیده
منابع مشابه
Structural operational semantics for non-deterministic processes with quantitative aspects
General frameworks have been recently proposed as unifying theories for processes combining non-determinism with quantitative aspects (such as probabilistic or stochastically timed executions), aiming to provide general results and tools. This paper provides two contributions in this respect. First, we present a general GSOS specification format and a corresponding notion of bisimulation for no...
متن کاملGSOS for Probabilistic Transition Systems
We introduce PGSOS, an operator specification format for (reactive) probabilistic transition systems which bears similarity to the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all models bisimilarity is a congruence and the up-to-context proof principle is valid. Moreover, guarded recursive equations...
متن کاملGSOS for non-deterministic processes with quantitative aspects
Recently, some general frameworks have been proposed as unifying theories for processes combining non-determinism with quantitative aspects (such as probabilistic or stochastically timed executions), aiming to provide general results and tools. This paper provides two contributions in this respect. First, we present a general GSOS specification format (and a corresponding notion of bisimulation...
متن کاملGSOS for probabilistic transition systems ( extended abstract )
We introduce probabilistic GSOS, an operator specification format for (reactive) probabilistic transition systems which arises as an adaptation of the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, the format is well behaved in the sense that on all models bisimilarity is a congruence and the up-to-context proof principle is valid. Moreover, every s...
متن کاملGSOS and Finite Labelled Transition Systems
Aceto, L., GSOS and finite labelled transition systems, Theoretical Computer Science 131 (1994) 181-195. Recently there has been considerable interest in studying formats of Plotkin style inference rules which ensure that the induced labelled transition system semantics have certain properties, In this note, I shall give a contribution to this line of research by giving a restricted version of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002